Online bin covering with limited migration

نویسندگان

چکیده

Semi-online models where decisions may be revoked in a limited way have been studied extensively the last years. A well-studied measure of amount that can is (constant) migration factor. When an object arrives, for objects total size at most factor times its revoked. This means small only leads to changes. We study bin covering problem with different scenarios. develop algorithms both static case insertions are allowed, and dynamic case, items also depart. lower bounds these scenarios amortized worst-case showing our nearly optimal asymptotic competitive ratio. therefore resolve competitiveness migration.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Bin Covering: Expectations vs. Guarantees

Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin. For online bin covering, competitive analysis fails to distinguish between most algorithms of interest; all “reasonable” algorithms have a competitive ratio of 1 2 . Thus, in order to get a better understandin...

متن کامل

A Robust AFPTAS for Online Bin Packing with Polynomial Migration,

In this paper we develop general LP and ILP techniques to find an approximate solution with improved objective value close to an existing solution. The task of improving an approximate solution is closely related to a classical theorem of Cook et al. [7] in the sensitivity analysis for LPs and ILPs. This result is often applied in designing robust algorithms for online problems. We apply our ne...

متن کامل

On semi-online machine scheduling and generalized bin covering

In this thesis we study algorithms for scheduling problems. We investigate semi-online minimum makespan scheduling and generalized bin covering. In online minimum makespan scheduling we are given a set of m machines and n jobs, where each job Jt is specified by a processing time. The jobs arrive one by one and we have to assign them to the machines without any knowledge about future incoming jo...

متن کامل

Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing

We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for unif...

متن کامل

Selfish bin covering

In this paper, we address the selfish bin covering problem, which is greatly related both to the bin covering problem, and to the weighted majority game. What we are mainly concerned with is howmuch the lack of central coordination harms social welfare. Besides the standard PoA and PoS, which are based on Nash equilibrium, we also take into account the strong Nash equilibrium, and several new e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2023

ISSN: ['1090-2724', '0022-0000']

DOI: https://doi.org/10.1016/j.jcss.2023.01.001